unsatisfiable statement

См. также в других словарях:

• First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

• Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

• Tautology (logic) — In propositional logic, a tautology (from the Greek word ταυτολογία) is a propositional formula that is true under any possible valuation (also called a truth assignment or an interpretation) of its propositional variables. For example, the… …   Wikipedia

• Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… …   Wikipedia

• Gödel's ontological proof — is a formalization of Saint Anselm s ontological argument for God s existence by the mathematician Kurt Gödel.St. Anselm s ontological argument, in its most succinct form, is as follows: God, by definition, is that than which a greater cannot be… …   Wikipedia

• Ernst Mally — (11 October 1879 8 March 1944) was an Austrian philosopher affiliated with the so called Graz School of phenomenology. A pupil of Alexius Meinong, he was one of the founders of deontic logic and is mainly known for his contributions in that field …   Wikipedia

• Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

• Contradiction — In classical logic, a contradiction consists of a logical incompatibility between two or more propositions. It occurs when the propositions, taken together, yield two conclusions which form the logical, usually opposite inversions of each other.… …   Wikipedia

• Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… …   Wikipedia

• Barber paradox — This article is about a paradox of self reference. For an unrelated paradox in the theory of logical conditionals with a similar name, introduced by Lewis Carroll, see the Barbershop paradox. The Barber paradox is a puzzle derived from Russell s… …   Wikipedia

• DPLL algorithm — The Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking based algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF SAT problem. It was introduced in …   Wikipedia